Generalized compact multi-grid
نویسندگان
چکیده
منابع مشابه
Generalized Compact Multi-grid
-Extending our recent work, based on the ideas of the multi-grid iteration, we decrease the storage space for a smooth solution of a nonlinear PDF. and, furthermore, for any smooth function on a multi-dimensional grid and on discretization sets other than grids. A new approach to the numerical evaluation and storage of the solutions to a large class of linear part ial differential equations (PD...
متن کاملA Multi-Grid Method for Generalized Lyapunov Equations
We present a multi-grid method for a class of structured generalized Lya-punov matrix equations. Such equations need to be solved in each step of the Newton method for algebraic Riccati equations, which arise from linear-quadratic optimal control problems governed by partial diierential equations. We prove the rate of convergence of the two-grid method to be bounded independent of the dimension...
متن کاملCompact Grid Representation of Graphs
A graph G is said to be grid locatable if it admits a representation such that vertices are mapped to grid points and edges to line segments that avoid grid points but the extremes. Additionally G is said to be properly embeddable in the grid if it is grid locatable and the segments representing edges do not cross each other. We study the area needed to obtain those representations for some gra...
متن کاملDesign of Compact Multi-Channel Diplexer Using Defected Microstrip Structure
In this paper, two compact quad-channel and six-channel diplexer are designed and fabricated using defected microstrip structure (DMS). This structure is designed for the desired frequency based on the literature reviews. The proposed configuration is composed of a conventional T-junction divider with two pairs of open bended stubs and dual/tri-band filters. In designing dual band filters, a lo...
متن کاملCompact Enumeration Formulas for Generalized Partitions
Counting the number of elements in finite sets Si (where i typically ranges over some index set I such as the non–negative integers or a cartesian product of the non–negative integers) is surely one of the oldest and most fundamental problems in mathematics. It is in the nature of the subject that only a few enumeration problems have a compact solution in terms of a simple explicit formula in i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 1993
ISSN: 0898-1221
DOI: 10.1016/0898-1221(93)90126-g